A Class of Smoothing Modulus-Based Iterative Methods for Solving the Stochastic Mixed Complementarity Problems

نویسندگان

چکیده

In this paper, we present a smoothing modulus-based iterative method for solving the stochastic mixed complementarity problems (SMCP). The main idea is that firstly transform expected value model of SMCP into an equivalent nonsmooth system equations, then obtain approximation smooth equations by using function, and finally solve it Newton method. We give convergence analysis, numerical results show effectiveness new with symmetry coefficient matrices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Methods for a Class of Complementarity Problems

In this paper, we propose and study an algorithm for a new class of complementarity problems of finding u E R” such that u > 0, Tu + A(u) > 0; (u, Tu + A(u)) = 0, where T is a continuous mapping and A is a nonlinear transformation from R” into itself. It is proved that the approximate solution obtained from the iterative scheme converges to the exact solution. Several special cases are also dis...

متن کامل

Smoothing Newton and Quasi-Newton Methods for Mixed Complementarity Problems

The mixed complementarity problem can be reformulated as a nonsmooth equation by using the median operator. In this paper, we rst study some useful properties of this reformulation and then derive the Chen-Harker-Kanzow-Smale smoothing function for the mixed complementarity problem. On the basis of this smoothing function, we present a smoothing Newton method for solving the mixed complementari...

متن کامل

Convergence analysis of modulus-based matrix splitting iterative methods for implicit complementarity problems

In this paper, we demonstrate a complete version of the convergence theory of the modulus-based matrix splitting iteration methods for solving a class of implicit complementarity problems proposed by Hong and Li (Numer. Linear Algebra Appl. 23:629-641, 2016). New convergence conditions are presented when the system matrix is a positive-definite matrix and an [Formula: see text]-matrix, respecti...

متن کامل

Modulus-based synchronous multisplitting iteration methods for linear complementarity problems

To reduce the communication among processors and improve the computing time for solving linear complementarity problems, we present a two-step modulus-based synchronous multisplitting iteration method and the corresponding symmetric modulus-based multisplitting relaxation methods. The convergence theorems are established when the system matrix is an H+-matrix, which improve the existing converg...

متن کامل

A smoothing Broyden-like method for the mixed complementarity problems

K e y w o r d s M i x e d complementarity problem, Smoothing Broyden-like method, Global convergence, Superlinear convergence. 1. I N T R O D U C T I O N Let F : R n ~ R n be a cont inuous ly differentiable ma pp i ng and X = {1 < x < u} be a n o n e m p t y closed convex set in R n. The mixed complementarity problem, denoted by MCP(F), is to find a vector x* E X, such that F (x*) T (x x*) _> 0...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2023

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym15010229